Progress in Deriving Concurrent Programs: Emphasizing the Role of Stable Guards
نویسندگان
چکیده
We present some techniques to obtain smooth derivations of concurrent programs that address both safety and progress in a formal manner. Our techniques form an extension to the calculational method of Feijen and van Gasteren using a UNITY style progress logic. We stress the role of stable guards, and we illustrate the derivation techniques on some examples in which progress plays an essential role.
منابع مشابه
Finite-state concurrent programs can be expressed pairwise
We present a pairwise normal form for finite-state shared memory concurrent programs: all variables are shared between exactly two processes, and the guards on transitions are conjunctions of conditions over this pairwise shared state. This representation has been used to efficiently (in polynomial time) synthesize and model-check correctness properties of concurrent programs. Our main result i...
متن کاملTypes for Deadlock-Free Higher-Order Concurrent Programs
Deadlock freedom is for concurrent programs what progress is for sequential ones: it indicates the absence of stable (i.e., irreducible) states in which some pending operations cannot be completed. In the particular case of communicating processes, operations are inputs and outputs on channels and deadlocks may be caused by mutual dependencies between communications. In this work we define an e...
متن کاملThe Effect of Concurrent Training and Chlorogenic Acid Intake on Liver Enzymes and C-reactive Protein in Obese Women
Background & objectives: Due to the prevalence of obesity and the subsequent development of metabolic risk factors, cardiovascular and fatty liver complications, exercise programs and the use of natural supplements can play a significant role in controlling and preventing these diseases. Therefore, the purpose of this study was to review the effect of eight weeks of combined exercise and Chlo...
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملبرنامه های ترویج کارآفرینی زنان در کشورهای منتخب
Objective: In the past decades, by focusing on the positive and effective role of economic entrepreneurship in the development of society, developed countries and, in more recent decades, a few developing countries have considered deriving benefits from this potential in combating economic difficulties such as recession, inflation, and unemployment. Entrepreneurship can serve as a wellknown...
متن کامل